Structural Recursion over Contextual Objects
نویسندگان
چکیده
A core programming language is presented that allows structural recursion over open LF objects and contexts. The main technical tool is a coverage checking algorithm that also generates valid recursive calls. Termination of call-byvalue reduction is proven using a reducibility semantics. This establishes consistency and allows the implementation of proofs about LF specifications as well-founded recursive functions using simultaneous pattern matching.
منابع مشابه
Well-Founded Recursion over Contextual Objects
We present a core programming language that supports writing well-founded structurally recursive functions using simultaneous pattern matching on contextual LF objects and contexts. The main technical tool is a coverage checking algorithm that also generates valid recursive calls. To establish consistency, we define a call-by-value small-step semantics and prove that every well-typed program te...
متن کاملDynamic Recursion Pattern
Everybody knows what recursion is and how it should be implemented in a procedural language. The first analysis of recursion implementations is due Kent Beck [Beck92], but no formalization was given. The other work on an OOP implementation of the subject is due to Boby Wolf [Wolf97], but his work only deals with one aspect of the problem: Structural Recursion. Structural Recursion is a particul...
متن کاملStructural Recursion on Ordered Trees and List-Based Complex Objects
XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vertical recursion down a tree combined with horizontal recursion across a list of trees gives rise to a robust class of transformations: it captures t...
متن کاملStructural Recursion on Ordered Trees and List-based Complex Objects Expressiveness and PTIME Restrictions
XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vertical recursion down a tree combined with horizontal recursion across a list of trees gives rise to a robust class of transformations: it captures t...
متن کاملChildren’s use of argument structure, meta-knowledge of the lexicon, and extra-linguistic contextual cues in inferring meanings of novel verbs
Verbs are the centerpiece of the sentence, and understanding of verb meanings is essential for language acquisition. Yet verb learning is said to be more challenging than noun learning for young children for several reasons. First, while nouns tend to denote concrete objects, which are perceptually stable over time, verbs tend to refer to action events, which are temporally ephemeral, and the b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014